Dyck Paths, Motzkin Paths, and the Binomial Transform
نویسندگان
چکیده
We study the moments of orthogonal polynomial sequences (OPS) arising from tridiagonal matrices. We obtain combinatorial information about the sequence of moments of some OPS in terms of Motzkin and Dyck paths, and also in terms of the binomial transform. We then introduce an equivalence relation on the set of Dyck paths and some operations on them. We determine a formula for the cardinality of those equivalence classes, and use this information to obtain a combinatorial formula for the number of Dyck and Motzkin paths of a fixed length.
منابع مشابه
A Bijection Between 3-Motzkin Paths and Schröder Paths With No Peak at Odd Height
A new bijection between 3-Motzkin paths and Schröder paths with no peak at odd height is presented, together with numerous consequences involving related combinatorial structures such as 2-Motzkin paths, ordinary Motzkin paths and Dyck paths.
متن کاملECO method and hill-free generalized Motzkin paths
In this paper we study the class of generalized Motzkin paths with no hills and prove some of their combinatorial properties in a bijective way; as a particular case we have the Fine numbers, enumerating Dyck paths with no hills. Using the ECO method, we define a recursive construction for Dyck paths such that the number of local expansions performed on each path depends on the number of its hi...
متن کاملGeneralizations of The Chung-Feller Theorem
The classical Chung-Feller theorem [2] tells us that the number of Dyck paths of length n with flaws m is the n-th Catalan number and independent on m. L. Shapiro [7] found the Chung-Feller properties for the Motzkin paths. In this paper, we find the connections between these two Chung-Feller theorems. We focus on the weighted versions of three classes of lattice paths and give the generalizati...
متن کاملMotzkin Paths with Vertical Edges
This paper considers finite lattice paths formed from the set of step vectors {→, ↗,↘, ↑, and ↓} with the restriction that vertical steps (↑, ↓) can not be consecutive. We provide a recurrence relation for enumerating paths that terminate a horizontal distance n and vertical distance m from the starting point and apply the relation to paths which are restricted to the first quadrant and paths w...
متن کاملIdentities from Weighted Motzkin Paths
Based on a weighted version of the bijection between Dyck paths and 2-Motzkin paths, we find combinatorial interpretations of two identities related to the Narayana polynomials and the Catalan numbers. These interpretations answer two problems posed recently by Coker. AMS Classification: 05A15, 05A19
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015